package binTreeDeSe;


import java.util.Arrays;

/**
 * @className: BinaryTreeSort
 * @Description:
 * @Author: wangyifei
 * @Date: 2022/8/26 17:26
 */
public class BinaryTreeSort {
    public static void main(String[] args) {
        int[] array = {1,4,33,221,44,342,98,787};
        sort(array);
//        System.out.println(Arrays.toString(array));
    }
    public static void sort(int[] array){
        TreeNode node = null ;
        TreeNode current = null ;

        for (int i : array) {
            node = new TreeNode(i);
        }
    }
    public static void insertNode(TreeNode node , TreeNode root){

    }
}
